Using swaps and deletes to make strings match
نویسنده
چکیده
Given a source and a target string, their swap-delete-edit distance is the minimum number of interchange-consecutive-symbols and delete operations applied to the source string to make it equal the target string. We show that the swap-delete-edit distance of strings over alphabets of bounded size can be computed in polynomial time.
منابع مشابه
Pattern Matching with Swaps in Practice
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one seeks, for every text location with a swapped match of P , the number of swaps necessary to obtain a match at the location. In this paper we devise two general algorithms for both...
متن کاملAudio-Based Cover Song Retrieval Using Approximate Chord Sequences: Testing Shifts, Gaps, Swaps and Beats
This paper presents a variation on the theme of using string alignment for MIR in the context of cover song identification in audio collections. Here, the strings are derived from audio by means of HMM-based chord estimation. The characteristics of the cover-song ID problem and the nature of common chord estimation errors are carefully considered. As a result strategies are proposed and systema...
متن کاملAn Efficient Algorithm for Approximate Pattern Matching with Swaps
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one seeks to compute, for every text location with a swapped match of P , the number of swaps necessary to obtain a match at the location. In this paper, we present new efficient algo...
متن کاملThe ld and dlad Bio-Operations on Formal Languages
We continue the language theoretic study of operations suggested by the gene unscrambling process in stichotrichous ciliates. One of the two complementary models of gene unscrambling is based on operations inspired by the ways in which a DNA molecule can fold: hi (hairpin loop with inverted pointers) which reverses a substring between a pointer sequence and its reverse, ld(loop with direct poin...
متن کاملPatter Matching with Swaps in Linear Time for Short Patterns
The Pattern Matching problem with Swaps consists in finding all occurrence of a pattern P in a text T allowing a series of local swaps in the pattern where all the swaps are constrained to be disjoint. In the Approximate Pattern Matching problem with Swaps the output is, for every text location where there is a swapped match of P , the number of swaps necessary to create the swapped version tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 562 شماره
صفحات -
تاریخ انتشار 2015